Proof of the Density

نویسندگان

  • Ping Wang
  • Andrew J. Granville
  • Helmut Maier
  • Chuan-Sheng Wu
چکیده

The Riemann zeta function is a meromorphic functionon the whole complex plane. It has infinitely many zeros and aunique pole at s = 1. Those zeros at s = −2,−4,−6, . . . areknown as trivial zeros. The Riemann hypothesis, conjectured byBernhard Riemann in 1859, claims that all non-trivial zeros of ζ(s)lie on the line R(s) =12 . The density hypothesis is a conjecturedestimate N(λ, T ) = O(T 2(1−λ)+ǫ) for any ǫ > 0, where N(λ, T ) isthe number of zeros of ζ(s) when R(s) ≥ λ and 0 < I(s) ≤ T ,with12 ≤ λ ≤ 1 and T > 0. The Riemann-von Mangoldt Theoremconfirms this estimate when λ =12 , with T ǫ being replaced bylog T . The xi-function ξ(s) is an entire function involving ζ(s) andthe Euler Gamma function Γ(s). This function is symmetric withrespect to the line R(s) =12 , although neither ζ(s) nor Γ(s) exhibitsthis property. In an attempt to transform Backlund’s proof of theRiemann-von Mangoldt Theorem, from 1918, to a proof of thedensity hypothesis by convexity, we discovered a slightly differentapproach utilizing a modified version of the Euler Gamma function.This modified version is symmetric with respect to the line R(s) =12 , and its reciprocal is an entire function. Aided by this function,we are able to establish a proof of the density hypothesis. Actually,our result is even stronger when 12 < λ < 1, with N(λ, T ) =O(

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A new security proof for FMNV continuous non-malleable encoding scheme

A non-malleable code is a variant of an encoding scheme which is resilient to tampering attacks. The main idea behind non-malleable coding is that the adversary should not be able to obtain any valuable information about the message. Non-malleable codes are used in tamper-resilient cryptography and protecting memories against tampering attacks. Many different types of non-malleability have alre...

متن کامل

A simple proof of Zariski's Lemma

‎Our aim in this very short note is to show that the proof of the‎ ‎following well-known fundamental lemma of Zariski follows from an‎ ‎argument similar to the proof of the fact that the rational field‎ ‎$mathbb{Q}$ is not a finitely generated $mathbb{Z}$-algebra.

متن کامل

A SHORT PROOF FOR THE EXISTENCE OF HAAR MEASURE ON COMMUTATIVE HYPERGROUPS

In this short note, we have given a short proof for the existence of the Haar measure on commutative locally compact hypergroups based on functional analysis methods by using Markov-Kakutani fixed point theorem.

متن کامل

A new proof for the Banach-Zarecki theorem: A light on integrability and continuity

To demonstrate more visibly the close relation between thecontinuity and integrability, a new proof for the Banach-Zareckitheorem is presented on the basis of the Radon-Nikodym theoremwhich emphasizes on measure-type properties of the Lebesgueintegral. The Banach-Zarecki theorem says that a real-valuedfunction $F$ is absolutely continuous on a finite closed intervalif and only if it is continuo...

متن کامل

Groups with one conjugacy class of non-normal subgroups‎ - ‎a short proof

For a finite group $G$ let $nu(G)$ denote the number of conjugacy classes of non-normal subgroups of $G$. We give a short proof of a theorem of Brandl, which classifies finite groups with $nu(G)=1$.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009